Reference Jacobian Optimization-Based Rezone Strategies for Arbitrary Lagrangian Eulerian Methods
نویسندگان
چکیده
منابع مشابه
ReALE: A reconnection-based arbitrary-Lagrangian-Eulerian method
We present a new reconnection-based Arbitrary Lagrangian Eulerian (ALE) method. The main elements in a standard ALE simulation are an explicit Lagrangian phase in which the solution and grid are updated, a rezoning phase in which a new grid is defined, and a remapping phase in which the Lagrangian solution is transferred (conservatively interpolated) onto the new grid. In standard ALE methods t...
متن کاملReALE: A Reconnection Arbitrary-Lagrangian-Eulerian method in cylindrical geometry
This paper deals with the extension to the cylindrical geometry of the recently introduced Reconnection algorithm for Arbitrary-Lagrangian-Eulerian (ReALE) framework. The main elements in standard ALE methods are an explicit Lagrangian phase, a rezoning phase, and a remapping phase. Usually the new mesh provided by the rezone phase is obtained by moving grid nodes without changing connectivity ...
متن کاملThe Error-Minimization-based Rezone Strategy for Arbitrary Lagrangian-Eulerian Methods
The objective of the Arbitrary Lagrangian-Eulerian (ALE) methodology for solving multidimensional fluid flow problems is to move the computational mesh, using the flow as a guide, to improve the robustness, accuracy and efficiency of a simulation. The main elements in the ALE simulation are an explicit Lagrangian phase, a rezone phase in which a new mesh is defined, and a remapping (conservativ...
متن کاملReference Jacobian Rezoning Strategy for Arbitrary Lagrangian - Eulerian Methods on Polyhedral Grids
The rezoning step is an important part of the Arbitrary Lagrangian-Eulerian (ALE) simulation cycle. The objective of the rezoning algorithm is to improve geometric quality of the mesh elements by minimalistic repositioning of the mesh nodes. By means of numerical experiment we show that the Reference Jacobian rezoning effectively eliminates ill-shaped elements of 3D polyhedral grid while keepin...
متن کاملOptimization-based smoothing algorithm for triangle meshes over arbitrarily shaped domains
This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The local optimization scheme is a damped Newton’s method in which the gradient and Hessian of the objective function are evaluated exactly. The algorithm has be...
متن کامل